Performing Algorithmic Reenement before Data Reenement in B Performing Algorithmic Reenement before Data Reenement in B

نویسندگان

  • Michael Butler
  • Mairead Meagher
چکیده

Algorithmic Reenement is part of the theory of the B method both at the reenement and implementation stages. It a sign of how little loop introduction is used in practice at the reenement stage that neither the B-Toolkit nor Atelier-B provide support for loop introduction until the implementation stage. This paper examines the use of algorithmic reenement in general before data reenement. This involves extending the usual scope of data reenement which usually happens before algorithmic reenement. Two case studies are used to compare and contrast the application of algorithmic reenement before data reenement and vice versa. Some extensions are needed in the B-Toolkit to implement this style (i.e., algorithmic before data reenement) and are proposed. Some workarounds are also presented when appropriate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Class Re nement and Interface Re nement inObject - Oriented

Constructing new classes from existing ones by inheritance or subclassing is a characteristic feature of object-oriented development. Imposing semantic constraints on subclassing allows us to ensure that the behaviour of superclasses is preserved or reened in their subclasses. This paper deenes a class reenement relation which captures these semantic constraints. The class reenement relation is...

متن کامل

Parallelizing Subgraph Isomorphism Reenement for Classiication and Retrieval of Conceptual Structures 3 a Relation-based Representation For

abstract Major applications of graph-based knowledge representations will require quick response times on extremely large knowledge bases. Although algorithmic developments have provided tremendous improvements in speed, we believe implementation on parallel processors will be needed to meet long-term needs. This paper presents a new parallelization of a subgraph isomorphism reenement algorithm...

متن کامل

Automated Reenement Checking for Asynchronous Processes

We consider the problem of reenement checking for asyn-chronous processes where reenement corresponds to stutter-closed language inclusion. Since an eecient algorithmic solution to the reenement check demands the construction of a witness that deenes the private speciication variables in terms of the implementation variables, we rst propose a construction to extract a synchronous witness from t...

متن کامل

The Lattice of Data Reenement

We deene a very general notion of data reenement which comprises the traditional notion of data reenement as a special case. Using the concepts of duals and adjoints we deene converse commands and a nd a symmetry between ordinary data reenement and a dual (backward) data reenement. We show how ordinary and backward data reenement are interpreted as simulation and we derive rules for the piecewi...

متن کامل

Constructive Data Reenement in Typed Lambda Calculus

A new treatment of data reenement in typed lambda calculus is proposed, based on pre-logical relations HS99] rather than logical relations as in Ten94], and incorporating a constructive element. Constructive data reenement is shown to have desirable properties, and a substantial example of reenement is presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000